Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
نویسندگان
چکیده
A Unifying Framework for the Convexification of Mixed-Integer Conic Binary Sets The paper “Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications,” by Fatma Kilinc-Karzan, Simge Kucukyavuz, Dabeen Lee, Soroosh Shafieezadeh-Abadeh, develops a unifying framework convexifying mixed-integer conic binary sets. Many applications in machine-learning operations research give rise to integer programming models with nonlinear structures variables. general methods generating strong valid inequalities that take into account multiple constraints at same time. authors demonstrate their applies quadratic variables, fractional programming, best subset selection, distributionally robust optimization, sparse approximation positive semidefinite matrices.
منابع مشابه
Characterizations of Mixed Binary Convex Quadratic Representable Sets
Representability results play a fundamental role in optimization since they provide geometric characterizations of the feasible sets that arise from optimization problems. In this paper we study the sets that appear in the feasibility version of mixed binary convex quadratic optimization problems. We provide a number of characterizations of the sets that can be obtained as the projection of suc...
متن کاملConvex hull characterizations of lexicographic orderings
Abstract Given a p-dimensional nonnegative, integral vector α, this paper characterizes the convex hull of the set S of nonnegative, integral vectors x that is lexicographically less than or equal to α. To obtain a finite number of elements in S, the vectors x are restricted to be component-wise upper-bounded by an integral vector u. We show that a linear number of facets is sufficient to descr...
متن کاملA conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
We study the convex hull of the intersection of a convex set E and a disjunctive set. This intersection is at the core of solution techniques for Mixed Integer Convex Optimization. We prove that if there exists a cone K (resp., a cylinder C) that has the same intersection with the boundary of the disjunction as E , then the convex hull is the intersection of E with K (resp., C). The existence o...
متن کاملA Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems
This paper is concerned with the generation of tight equivalent representations for mixedinteger zero-one programming problems. For the linear case, we propose a technique which first converts the problem into a nonlinear, polynomial mixed-integer zero-one problem by multiplying the constraints with some suitable d-degree polynomial factors involving the n binary variables, for any given d E (0...
متن کاملConvex Sets and their Applications
The main objective of this Workshop was to bring together in Banff eminent and emerging researchers from the three main branches of Convex Geometry: Discrete, Analytical and Applied. There has not been such a unifying conference in the past fifteen years. The organizers believe that this objective was met during the week of March 4 9. First, of the thirty-nine participants, one third represente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2023
ISSN: ['1526-5463', '0030-364X']
DOI: https://doi.org/10.1287/opre.2020.0827